Generalized H-Coloring and H-Covering of Trees

Generalized Covering Groups and Direct Limits

On subgroups of topologized fundamental groups and generalized coverings

‎In this paper‎, ‎we are interested in studying subgroups of topologized fundamental groups and their influences on generalized covering maps‎. ‎More precisely‎, ‎we find some relationships between generalized covering subgroups and the other famous subgroups of the fundamental group equipped with the compact-open topology and the whisker topology‎. ‎Moreover‎, ‎we present some conditions unde...

On the complexity of $\mathbb H$-coloring for special oriented trees

For a fixed digraph H, the H-coloring problem is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi is equivalent to proving that, for any H, the H-coloring problem is in in P or NP-complete. We confirm this dichotomy for a certain class of oriented trees, which we call special trees (generalizing earlier results o...

The starlikeness, convexity, covering theorem and extreme points of p-harmonic mappings

The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.

B-coloring of Cartesian Product of Trees

A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has a neighbor in each of the other color classes. The largest positive integer k for which G has a b-coloring using k colors is the b-chromatic number b(G) of G. The b-spectrum Sb(G) of a graph G is the set of positive integers k...